New facets for the planar subgraph polytope
نویسنده
چکیده
This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new class of facets for the polytope called 3-star subdivisions. It is also shown that the extended and 3-star subdivision facets are also equivalent to members of the class of facets with coefficients in {0,1,2} for the set covering polytope. Computational results displaying the effectiveness of the facets in a branch-and-cut scheme for the maximum planar subgraph problem are presented. keywords: planar graph, planar subgraph polytope, polyhedral combinatorics
منابع مشابه
A Polyhedral Approach to Planar Augmentation and Related Problems
Given a planar graph G the planar biconnectivity augmen tation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected Given a nonplanar and biconnected graph the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained Both problems are imp...
متن کاملFacet Generating Techniques
Given a polyhedron P which is of interest, a major goal of polyhedral combinatorics is to find classes of essential, i.e. facet inducing inequalities which describe P . In general this is a difficult task. We consider the case in which we have knowledge of facets for a face F of P , and present some general theory and methods for exploiting the close relationship between such polyhedra in order...
متن کاملMaximum Planar Subgraphs and Nice Embeddings :
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a number of topological and aesthetic constraints. Nice drawings for sparse nonplanar graphs can be achieved by determining a maximum planar subgraph and augmenting an embedding of this graph. This approach appears to be of limited value in practice, because the maximum planar subgraph problem is NP-...
متن کاملThe Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
In JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph of a given graph. One of the motivations was to produce a nice drawing of a given graph by drawing the found maximum planar subgraph, and then augmenting this drawing by the removed edges. Our experiments indicate that drawing algorithms for planar graphs which require 2-or 3-connectivity, resp. d...
متن کاملGenerating Facets for the Independence System Polytope
In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the use of these procedures by deriving strong valid inequalities for the acyclic induced subgraph, triangle free induced subgraph, bipartite induced subgraph, and knapsack polyto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 51 شماره
صفحات -
تاریخ انتشار 2008